Tracing clones

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Active Clones: Source Code Clones at Runtime

Code cloning is a common programming practice, and there have been a considerable amount of research that investigated the implications of code clones on software maintenance using static analysis. However, little has been done to investigate the runtime implications of code cloning. In this paper we investigate source code clones at runtime, referring to clones as ‘active clones’ if they are i...

متن کامل

Ray-tracing and Interferometry in Schwarzschild Geometry

Here, we investigate the possible optical anisotropy of vacuum due to gravitational field. In doing this, we provide sufficient evidence from direct coordinate integration of the null-geodesic equations obtained from the Lagrangian method, as well as ray-tracing equations obtained from the Plebanski’s equivalent medium theory. All calculations are done for the Schwarzschild geometry, which resu...

متن کامل

tracing the progress of process tracing

Building on a Lakatosian approach that sees Social Science as an endeavour that confronts rival theories with systematic empirical observations, this article responds to probing questions that have been raised about the appropriate ways in which to conduct systematic process analysis and comparative enquiry. It explores varieties of process tracing, the role of interpretation in case studies, a...

متن کامل

Tracing Efficient Path Using Web Path Tracing

In the fast improving society, people depend on online purchase of goods than spending time physically. So there are lots of resources emerged for this online buying and selling of materials. Efficient and attractive web sites would be the best to sell the goods to people. To know whether a web site is reaching the mind of the customers or not, a high speed analysis is done periodically by the ...

متن کامل

Oligomorphic Clones

A permutation group on a countably infinite domain is called oligomorphic if it has finitely many orbits of finitary tuples. We define a clone on a countable domain to be oligomorphic if its set of permutations forms an oligomorphic permutation group. There is a close relationship to ω-categorical structures, i.e., countably infinite structures with a firstorder theory that has only one countab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature Reviews Cancer

سال: 2012

ISSN: 1474-175X,1474-1768

DOI: 10.1038/nrc3354